On embedding default logic into Moore's autoepistemic logic
نویسندگان
چکیده
منابع مشابه
Embedding Minimal Knowledge into Autoepistemic Logic
We investigate the epistemological properties of MKNF, Lif-schitz's logic of minimal knowledge and negation as failure. In particular, we show that the expressive power of MKNF is equivalent to Moore's au-toepistemic logic (AEL), by deening an embedding of MKNF into AEL and vice versa. We also prove that the negation as failure modality not of MKNF exactly corresponds to the negative introspect...
متن کاملEmbedding Description Logic Programs into Default Logic
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter et al. have been considered as a prominent formalism for integrating rules and ontology knowledge bases. A question of interest has been whether dl-programs can be captured in a general formalism of nonmonotonic logic. In this paper, we study the possibility of embedding dl-programs into default logic. W...
متن کاملEmbedding Non-Ground Logic Programs into Autoepistemic Logic
T τEB og = T τEH og follows from this claim, thereby establishing the first part of the proposition, concerning the embeddings τEB and τEH . Every entailed objective ground formula is equivalent to a conjunction of ground clauses c = l1 ∨ · · · ∨ lk, where each li is either an atom pi or a negated atom ¬pi. Clearly, Toga |= c iff li ∈ Toga for some li in c. To prove (2), clearly T τ og ⊇ {φ ∈ L...
متن کاملCombining Default Logic and Autoepistemic Logic
When we work with information from multiple sources, the formats of the knowledge bases may not be uniform. It would be desirable to be able to combine a knowledge base of default rules with one containing autoepistemic formulas. Previous works on relating default logic and autoepistemic logic mostly impose some constraints on autoepistemic logic, and thus are not suitable for combining the two...
متن کاملOn the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, the extension existence problem for default logic, as well as the expansion existence problem for autoepistemic logic and obtain fixed-parameter time and space efficient algorithms for these problems. On the other hand, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1996
ISSN: 0004-3702
DOI: 10.1016/0004-3702(95)00117-4